Efficient producer mobility support in named data networking

Named Data Networking (NDN) is a promising architecture for the future Internet and it is mainly designed for efficient content delivery and retrieval. However, producer mobility support is one of the challenging problems of NDN. This paper proposes a scheme which aims to optimize the tunneling-based producer mobility solution in NDN. It does not require NDN routers to change their routing tables (Forwarding Information Base) after a producer moves. Instead, the Interest packet can be sent from a consumer to the moved producer using the tunnel. The piggybacked Data packet which is sent back to the consumer will trigger the consumer to send the following Interest packets through the optimized path to the producer. Moreover, a naming scheme is proposed so that the NDN caching function can be fully utilized. An analysis is carried out to evaluate the performance of the proposal. The results indicate that the proposed scheme reduces the network cost compared to related works and supports route optimization for enhanced producer mobility support in NDN

ERAD components Derlin-1 and Derlin-2 are essential for postnatal brain development and motor function

Derlin family members (Derlins) are primarily known as components of the endoplasmic reticulum-associated degradation pathway that eliminates misfolded proteins. Here we report a function of Derlins in the brain development. Deletion of Derlin-1 or Derlin-2 in the central nervous system of mice impaired postnatal brain development, particularly of the cerebellum and striatum, and induced motor control deficits. Derlin-1 or Derlin-2 deficiency reduced neurite outgrowth in vitro and in vivo and surprisingly also inhibited sterol regulatory element binding protein 2 (SREBP-2)-mediated brain cholesterol biosynthesis. In addition, reduced neurite outgrowth due to Derlin-1 deficiency was rescued by SREBP-2 pathway activation. Overall, our findings demonstrate that Derlins sustain brain cholesterol biosynthesis, which is essential for appropriate postnatal brain development and function

Issues on Synchronizing and Scheduling Tasks in Real-Time Database Systems

115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Real-time systems have timing requirements. In database systems, database operations are performed in a sequence so as to maintain database consistency. By combining the features of a real-time system and a database system, a real-time database system must satisfy requirements from both models. Unfortunately, the requirements from the two models are not always compatible. In order to satisfy the timing requirements, transactions must be scheduled in a temporally predictable fashion. On the other hand, some transactions may have to be suspended in order to maintain the database consistency. The suspension causes disturbances in scheduling and may result in temporally unpredictable behavior. The priority ceiling protocol has been proposed to satisfy the timing requirements under the existence of suspension. However, the priority ceiling protocol does not maintain database consistency. We propose a set of algorithms integrating scheduling and concurrency control in order to maintain database consistency and still satisfy the timing requirements. We describe the properties of the algorithms and compare them with the priority ceiling protocol.For real-time database systems with monitoring and controlling operations, there are additional requirements for data consistency. We therefore define external consistency and temporal consistency. In order to satisfy these additional requirements, we propose design strategies for the temporal aspect of a real-time database system. Finally, we describe how to assign specific deadlines to transactions from the timing requirements while utilizing the processor effectively.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD

CENTRALITY-BASED NETWORK CODER PLACEMENT FOR PEER-TO-PEER CONTENT DISTRIBUTION

ABSTRAC

Request Expectation Index Based Cache Replacement Algorithm For Streaming Content Delivery Over Icn

Since the content delivery unit over Information-Centric Networking (ICN) has shifted from files to the segments of a file named chunks, solely either file-level or chunk-level request probability is insufficient for ICN cache management. In this paper, a Request Expectation Index (RXI) based cache replacement algorithm for streaming content delivery is proposed. In this algorithm, RXI is introduced to serve as a fine-grained and unified estimation criteria of possible future request probability for cached chunks. RXI is customized for streaming content delivery by adopting both file-level and chunk-level request probability and considering the dynamically varied request status at each route as well. Compared to prior work, the proposed algorithm evicts the chunk with the minimum expectation of future request to maintain a high cache utilization. Additionally, simulation results demonstrate that the RXI-based algorithm can remarkably enhance the streaming content delivery performance and can be deployed in complex network scenarios. The proposed results validate that, by taking fine-grained request probability and request status into consideration, the customized in-network caching algorithm can improve the ICN streaming content delivery performance by high cache utilization, fast content delivery, and lower network traffic

Request Expectation Index Based Cache Replacement Algorithm for Streaming Content Delivery over ICN

Since the content delivery unit over Information-Centric Networking (ICN) has shifted from files to the segments of a file named chunks, solely either file-level or chunk-level request probability is insufficient for ICN cache management. In this paper, a Request Expectation Index (RXI) based cache replacement algorithm for streaming content delivery is proposed. In this algorithm, RXI is introduced to serve as a fine-grained and unified estimation criteria of possible future request probability for cached chunks. RXI is customized for streaming content delivery by adopting both file-level and chunk-level request probability and considering the dynamically varied request status at each route as well. Compared to prior work, the proposed algorithm evicts the chunk with the minimum expectation of future request to maintain a high cache utilization. Additionally, simulation results demonstrate that the RXI-based algorithm can remarkably enhance the streaming content delivery performance and can be deployed in complex network scenarios. The proposed results validate that, by taking fine-grained request probability and request status into consideration, the customized in-network caching algorithm can improve the ICN streaming content delivery performance by high cache utilization, fast content delivery, and lower network traffic